منابع مشابه
Illumination Chromaticity Estimation using Inverse-Intensity Chromaticity Space
Existing color constancy methods cannot handle both uniform colored surfaces and highly textured surfaces in a single integrated framework. Statistics-based methods require many surface colors, and become error prone when there are only few surface colors. In contrast, dichromaticbased methods can successfully handle uniformly colored surfaces, but cannot be applied to highly textured surfaces ...
متن کاملOn Chromaticity of Wheels
Let the vertices of a graph such that every two adjacent vertices have different color is a very common problem in the graph theory. This is known as proper coloring of graphs. The possible number of different proper colorings on a graph with a given number of colors can be represented by a function called the chromatic polynomial. Two graphs G and H are said to be chromatically equivalent, if ...
متن کاملMaterial-Specific Chromaticity Priors
Recent advances in machine learning have enabled the recognition of high-level categories of materials with a reasonable accuracy. With these techniques, we can construct a per-pixel material labeling from a single image. We observe that groups of high-level material categories have distinct chromaticity distributions. This fact can be used to predict the range of the absolute chromaticity valu...
متن کاملOn chromaticity of hypergraphs
Let H = (X,E) be a simple hypergraph and let f (H, ) denote its chromatic polynomial. Two hypergraphs H1 and H2 are chromatic equivalent if f (H1, ) = f (H2, ). The equivalence class of H is denoted by 〈H 〉. Let K and H be two classes of hypergraphs.H is said to be chromatically characterized in K if for every H ∈ H ∩K we have 〈H 〉 ∩K=H ∩K. In this paper we prove that uniform hypertrees and uni...
متن کاملOn chromaticity of graphs
Abstract In this paper we obtain the explicit formulas for chromatic polynomials of cacti. From the results relating to cacti we deduce the analogous formulas for the chromatic polynomials of n–gon–trees. Besides, we characterize unicyclic graphs by their chromatic polynomials. We also show that the so–called clique–forest–like graphs are chromatically equivalent.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Vision
سال: 2017
ISSN: 1534-7362
DOI: 10.1167/17.15.38